Complex Hadamard matrices with noncommutative entries
نویسندگان
چکیده
منابع مشابه
Almost Hadamard Matrices with Complex Entries
We discuss an extension of the almost Hadamard matrix formalism, to the case of complex matrices. Quite surprisingly, the situation here is very different from the one in the real case, and our conjectural conclusion is that there should be no such matrices, besides the usual Hadamard ones. We verify this conjecture in a number of situations, and notably for most of the known examples of real a...
متن کاملParametrizing complex Hadamard matrices
Abstract. The purpose of this paper is to introduce new parametric families of complex Hadamard matrices in two different ways. First, we prove that every real Hadamard matrix of order N ≥ 4 admits an affine orbit. This settles a recent open problem of Tadej and Życzkowski [11], who asked whether a real Hadamard matrix can be isolated among complex ones. In particular, we apply our construction...
متن کاملTrades in complex Hadamard matrices
A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order n all trades contain at least n entries. We call a trade rectangular if it consists of a submatrix that can be multiplied by some scalar c 6= 1 to obtain another complex Hadamard matrix. We give a characterisation of rectang...
متن کاملFamilies of Complex Hadamard Matrices
What is the dimension of a smooth family of complex Hadamard matrices including the Fourier matrix? We address this problem with a power series expansion. Studying all dimensions up to 100 we find that the first order result is misleading unless the dimension is 6, or a power of a prime. In general the answer depends critically on the prime number decomposition of the dimension. Our results sug...
متن کاملThe 2-transitive complex Hadamard matrices
We determine all possibilities for a complex Hadamard matrix H admitting an automorphism group which permutes 2-transitively the rows of H. Our proof of this result relies on the classification theorem for finite 2-transitive permutation groups, and thereby also on the classification of finite simple groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Functional Analysis
سال: 2018
ISSN: 2008-8752
DOI: 10.1215/20088752-2017-0042